Expectation Maximization of Frequent Patterns, a Specific, Local, Pattern-Based Biclustering Algorithm for Biological Datasets
نویسندگان
چکیده
منابع مشابه
Expectation-Maximization Algorithm with Local Adaptivity
We develop an expectation-maximization algorithm with local adaptivity for image segmentation and classification. The key idea of our approach is to combine global statistics extracted from the Gaussian mixture model or other proper statistical models with local statistics and geometrical information, such as local probability distribution, orientation, and anisotropy. The combined information ...
متن کاملDegenerate Expectation-Maximization Algorithm for Local Dimension Reduction
Dimension reduction techniques based on principal component analysis (PCA) and factor analysis are commonly used in statistical data analysis. The effectiveness of these methods is limited by their global nature. Recent efforts have focused on relaxing global restrictions in order to identify subsets of data that are concentrated on lower dimensional subspaces. In this paper, we propose an adap...
متن کاملA Pattern Decomposition (PD) Algorithm for Finding All Frequent Patterns in Large Datasets
Efficient algorithms to mine frequent patterns are crucial to many tasks in data mining. Since the Apriori algorithm was proposed in 1994, there have been several methods proposed to improve its performance. However, most still adopt its candidate set generation-and-test approach. We propose a pattern decomposition (PD) algorithm that can significantly reduce the size of the dataset on each pas...
متن کاملExpectation Maximization Algorithm for Domain Specific Ontology Extraction
Learning ontology from unstructured text is a challenging task. Over the years, a lot of research has been done to predict ontological relation between a pair of concepts. However all these measures predict relation with a varying degree of accuracy. There has also been work on learning ontology by combining evidences from heterogeneous sources, but most of these algorithms are ad hoc in nature...
متن کاملExpectation Maximization Deconvolution Algorithm
In this paper, we use a general mathematical and experimental methodology to analyze image deconvolution. The main procedure is to use an example image convolving it with a know Gaussian point spread function and then develop algorithms to recover the image. Observe the deconvolution process by adding Gaussian and Poisson noise at different signal to noise ratios. In addition, we will describe ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics
سال: 2016
ISSN: 1545-5963
DOI: 10.1109/tcbb.2015.2510011